Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms

نویسندگان

Fedor V. Fomin

Fabrizio Grandoni

Dieter Kratsch

چکیده

This survey concerns techniques in design and analysis of algorithms that can be used to solve NP hard problems faster than exhaustive search algorithms (but still in exponential time). We discuss several of such techniques: Measure & Conquer, Exponential Lower Bounds, Bounded Tree-width, and Memorization. We also consider some extensions of the mentioned techniques to parameterized algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

الگوریتم مستطیل آبشاری و ماتریس انتقال در شبکه های کوتاه ترین مسیر بادور

Shortest path problem is among the most interesting problems in the field of graph and network theory. There are many efficient matrix based algorithms for detecting of shortest path and distance between all pairs of this problem in literature. In this paper, a new exact algorithm, named Cascade Rectangle Algorithm, is presented by using main structure of previous exact algorithms and developin...

متن کامل

Comparison of Exact Analysis and Steplines Approximation for Externally Excited Exponential Transmission Line

In the present paper, the problem of externally excited exponential transmission line hasbeen solved analytically in frequency domain using a simple approach. Then steplines approximationas a first order approximation for the problem of externally excited nonuniform transmission lines ingeneral and exponentially tapered transmission line (ETL) as a special case has been presented.Finally the tw...

متن کامل

An Innovative Method for The Analysis of Structures with Tension-only Members

Due to their dual behavior under tension and compression, structures with tension-only members show non-linear behavior. To analize such structures, it is necessary to use a nonlinear analysis scheme. Nonlinear analysis methods generally use gradual loading techniques with/without modification of stiffness matrix of the structure. These methods, in addition to being time consuming algorithms, a...

متن کامل

Faster and Space Efficient Exact Exponential Algorithms: Combinatorial and Algebraic Approaches

Exponential algorithms, whose time complexity is O(c) for some constant c > 1, are inevitable when exactly solving NP-complete problems unless P = NP. This chapter presents recently emerged combinatorial and algebraic techniques for designing exact exponential time algorithms. The discussed techniques can be used either to derive faster exact exponential algorithms, or to significantly reduce t...

متن کامل